A Design Method for Relaxation Labeling Applications
نویسنده
چکیده
specified by a set of weighted preEerences, given by support functions si(R;p), which are functions of the labeling assignment 5. A separate function is given for each label at each object. The support si(R,F) can be positive or negative, and denotes the support which the current mix of weighted assignments lend to the prtiposition that object ai is label XX. In nearly all applications to date, the support functions are linear in 6: A summary of mathematical results developing a theory of consistency in ambiguous labelings is presented. This theory allows the relaxation labeling algorithm, introduced in [Rosenfeld, Hummel, Zucker, 19761, to be interpreted as a method for finding consistent labelings, and allows specific applications to be tailored in accordance with intended design goals. We discuss, with a couple of examples, a design methodology for using this theory for practical applications. si(R ;p> = z 1 j R' rij(R,R'> Pj("')l and depend principally on assignments objects a. PjCR') at
منابع مشابه
Relaxation Labeling for Selecting and Exploiting Efficiently Non-local Dependencies in Sequence Labeling
We consider the problem of sequence labeling and propose a two steps method which combines the scores of local classifiers with a relaxation labeling technique. This framework can account for sparse dynamically changing dependencies, which allows us to efficiently discover relevant non-local dependencies and exploit them. This is in contrast to existing models which incorporate only local relat...
متن کاملFuzzy Relaxation Labeling Reconsidered
|The problem of assigning labels to objects given some relational constraints is occuring quite often in the eld of pattern recognition. Among the diierent solutions proposed there is a particularly successful one: Relaxation labeling. Relaxation labeling has turned out to be a useful iterative scheme for parallel information integration forcing neighborhood constraint satisfaction. Consequentl...
متن کاملImage Matching based on Relaxation and Model Switching on Contour Characterization
Relaxation labeling algorithms introduced by Rosenfeld et al., have been widely used in image and sequence matching applications. The underlying mechanism of labeling via relaxation is a deterministic dynamical system whose initial status converges to one of the attractors. This is also a process of the input image segments being assigned the predetermined labels in a parallel and unsupervised ...
متن کاملA fast finite-state relaxation method for enforcing global constraints on sequence decoding
We describe finite-state constraint relaxation, a method for applying global constraints, expressed as automata, to sequence model decoding. We present algorithms for both hard constraints and binary soft constraints. On the CoNLL-2004 semantic role labeling task, we report a speedup of at least 16x over a previous method that used integer linear programming.
متن کاملSpeaker identification using relaxation labeling
A nonlinear probabilistic model of the relaxation labeling (RL) process is implemented in the speaker identification task in order to disambiguate the labeling of the speech feature vectors. Identification rates using the RL are higher than those using the conventional VQ (vector quantization) method.
متن کامل